A Lower Bound on the Substar Reliability of Star Networks
نویسندگان
چکیده
The star is one of the most fundamental architectures for interconnecting a large number of components in a network system. Based on the popularity of the star, the star network has been a good alternative to the hypercube-based topologies. Under the probability fault model, Wu and Latifi (2008) established an upper bound on the substar reliability for the class of star networks. However, a lower-bounded reliability plays a more informative role in maintaining system availability. For this reason, this paper is aimed at deriving an analytic lower bound on the substar reliability of star networks by means of combinatorial approach. In addition, numerical comparisons are presented for validating the proposed formulation.
منابع مشابه
A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملBroadcasting on Incomplete Star Graph Interconnection Networks
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broa...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملCold standby redundancy optimization for nonrepairable series-parallel systems: Erlang time to failure distribution
In modeling a cold standby redundancy allocation problem (RAP) with imperfect switching mechanism, deriving a closed form version of a system reliability is too difficult. A convenient lower bound on system reliability is proposed and this approximation is widely used as a part of objective function for a system reliability maximization problem in the literature. Considering this lower bound do...
متن کاملA Fault-tolerant Reconnguration Scheme in the Faulty Star Graph
In this paper, we propose a scheme to identify the maximal fault-free substar-ring. This is the rst result to derive a reconnguration scheme with high processor utilization in the faulty n-star graph. The maximal fault-free substar-ring is connected by a ring of fault-free virtual substars with dilation 3 and maximal length of the ring is n(n ? 1)(n ? 2). Our proposed scheme can tolerate n ? 3 ...
متن کامل